Propositional Logic of Imperfect Information: Foundations and Applications

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propositional Logic of Imperfect Information: Foundations and Applications

I will show that the semantic structure of a new imperfectinformation propositional logic can be described in terms of extensive forms of semantic games. I will discuss some ensuing properties of these games such as imperfect recall, informational consistency, and team playing. Finally, I will suggest a couple of applications that arise in physics, and most notably in quantum theory and quantum...

متن کامل

Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution

Until now, the focus has been on agents that act rationally. Often, however, rational action requires rational (logical) thought on the agent’s part. To that purpose, portions of the world must be represented in a knowledge base, or KB. A KB is composed of sentences in a language with a truth theory (logic), i.e. we (being external) can interpret sentences as statements about the world. (semant...

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality

Detection and elimination of redundant clauses from propositional formulas in Conjunctive Normal Form (CNF) is a fundamental problem with numerous application domains, including AI, and has been the subject of extensive research. Moreover, a number of recent applications motivated various extensions of this problem. For example, unsatisfiable formulas partitioned into disjoint subsets of clause...

متن کامل

Applications of propositional logic to workflow analysis

In this paper our main goal is to describe the structure of workflows. A workflow is an abstraction of a business process that consists of one ormore tasks to be executed to reach a final objective. In our approachwe describe aworkflow as a graphwhose vertices represent workflow tasks and the arcs representworkflow transitions.Moreover, every arc (tk, tl) (i.e., a transition) has attributed a B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 2001

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1063372242